Four Cellular Automata Algorithms for Matrix Permutation
نویسندگان
چکیده
منابع مشابه
Simulator for Testing Cellular Automata Cryptographic Algorithms
This paper presents, a simulator that aims the development and design of cellular-automata based cryptographic algorithms. This software is necessary mainly in order to choose a (large) set of local rules as possible keys that should be integrated in hardware. The software accepts linear and two-dimensional cellular automata having variable dimensions, limited to 100/100 cells (that gives a max...
متن کامل2D Elementary Cellular Automata with Four Neighbors
This paper is concerned with the study of square boolean synchronous four-neighbor peripheral cellular automata. It is first shown that, due to conjugation and plane reflection symmetry transformations, the number of dynamically nonequivalent such automata is equal to 4 856. The cellular automata for which the homogeneous final states play a significant role are then identified. Finally, it is ...
متن کاملAlgorithms for computing preimages of cellular automata configurations
This paper investigates preimages (ancestors or past configurations) of specified configurations of one-dimensional cellular automata. Both counting and listing of preimages are discussed. The main graphical tools used are the de Bruijn diagram, and its extension the preimage network, which is created by concatenating de Bruijn diagrams. The counting of preimages is performed as multiplication ...
متن کاملGenome Evolution by Matrix Algorithms: Cellular Automata Approach to Population Genetics
Mammalian genomes are replete with millions of polymorphic sites, among which those genetic variants that are colocated on the same chromosome and exist close to one another form blocks of closely linked mutations known as haplotypes. The linkage within haplotypes is constantly disrupted due to meiotic recombination events. Whole ensembles of such numerous haplotypes are subjected to evolutiona...
متن کاملCellular Automata: Elementary Cellular Automata
Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical stu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics and Mathematical Modeling
سال: 2020
ISSN: 2412-5911
DOI: 10.24108/mathm.0420.0000223